Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard

نویسنده

  • Christophe Costa Florêncio
چکیده

In [Bus87] and [BP90] some ‘discovery procedures’ for classical categorial grammars were defined. These procedures take a set of structures (strings labeled with derivational information) as input and yield a set of hypotheses in the form of grammars. In [Kan98] learning functions based on these discovery procedures were studied, and it was shown that some of the classes associated with these functions can be identified in the limit (i.e. are learnable) from strings, by a computable function. The time complexity of these functions however was still left an open question. In this paper we will show that the learning functions for these learnable classes are all NP-hard.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Learning from Strings of 2-Letter Rigid Grammars

It is well-known that certain classes of classical categorial grammars are learnable, within Gold’s paradigm of identification in the limit, from positive examples. In the search for classes which can be learned efficiently from strings, we study the class of 2-letter rigid grammars, which is the class of classical categorial grammars with an alphabet of two letters, each of which is assigned a...

متن کامل

Rigid Lambek Grammars Are Not Learnable from Strings

This paper is concerned with learning categorial grammars in Gold's model (Gold, 1967). Recently, learning algorithms in this model have been proposed for some particular classes of classical categorial grammars (Kanazawa, 1998). We show that in contrast to classical categorial grammars, rigid and k-valued Lambek grammars are not learnable from strings. This result holds for several variants of...

متن کامل

k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings

This paper is concerned with learning categorial grammars in Gold’s model. In contrast to k-valued classical categorial grammars, k-valued Lambek grammars are not learnable from strings. This result was shown for several variants but the question was left open for the weakest one, the non-associative variant NL. We show that the class of rigid and kvalued NL grammars is unlearnable from strings...

متن کامل

k-Valued Link Grammars are Learnable from Strings

The article is concerned with learning link grammars in the model of Gold. We show that rigid and k-valued link grammars are learnable from strings. In fact, we prove that the languages of link structured lists of words associated to rigid link grammars have finite elasticity and we show a learning algorithm. As a standard corollary, this result leads to the learnability of rigid or k-valued li...

متن کامل

On Intermediate Structures for Non-Associative Lambek Grammars and Learnability

This paper is concerned with learning categorial grammars in the model of Gold. We show that rigid and k-valued non-associative Lambek (NL) grammars are not learnable from well-bracketed sentences. In contrast to k-valued classical categorial grammars, k-valued Lambek grammars are not learnable from strings. This result was shown for several variants including the non-associative variant NL. Wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002